hosoya and merrifield-simmons indices of some classes of corona of two graphs
Authors
abstract
let $g=(v,e)$ be a simple graph of order $n$ and size $m$. an $r$-matching of $g$ is a set of $r$ edges of $g$ which no two of them have common vertex. the hosoya index $z(g)$ of a graph $g$ is defined as the total number of its matchings. an independent set of $g$ is a set of vertices where no two vertices are adjacent. the merrifield-simmons index of $g$ is defined as the total number of the independent sets of $g$. in this paper we obtain hosoya and merrifield-simmons indices of corona of some graphs.
similar resources
The Merrifield-Simmons indices and Hosoya indices of some classes of cartesian graph product
The Merrifield-Simmons index of a graph is defined as the total number of the independent sets of the graph and the Hosoya index of a graph is defined as the total number of the matchings of the graph. In this paper, we give formula for Merrifield-Simmons and Hosoya indices of some classes of cartesian product of two graphs K{_2}×H, where H is a path graph P{_n}, cyclic graph C{_n}, or star gra...
full textThe Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most k
The Hosoya index and the Merrifield–Simmons index of a graph are defined as the total number of the matchings (including the empty edge set) and the total number of the independent vertex sets (including the empty vertex set) of the graph, respectively. Let Vn,k be the set of connected n-vertex graphs with connectivity at most k. In this note, we characterize the extremal (maximal and minimal) ...
full textGraphs with maximal Hosoya index and minimal Merrifield-Simmons index
For a graph G, the Hosoya index and the Merrifield-Simmons index are defined as the total number of its matchings and the total number of its independent sets, respectively. In this paper, we characterize the structure of those graphs that minimize the Merrifield-Simmons index and those that maximize the Hosoya index in two classes of simple connected graphs with n vertices: graphs with fixed m...
full textSome extremal unicyclic graphs with respect to Hosoya index and Merrifield-Simmons index
The Hosoya index of a graph is defined as the total number of the matchings, including the empty edge set, of the graph. The Merrifield-Simmons index of a graph is defined as the total number of the independent vertex sets, including the empty vertex set, of the graph. Let U(n,∆) be the set of connected unicyclic graphs of order n with maximum degree ∆. We consider the Hosoya indices and the Me...
full textExtremal Hosoya index and Merrifield-Simmons index of hexagonal spiders
For any graph G, let m(G) and i(G) be the numbers of matchings (i.e., the Hosoya index) and the number of independent sets (i.e., the Merrifield–Simmons index) of G, respectively. In this paper, we show that the linear hexagonal spider and zig-zag hexagonal spider attain the extremal values of Hosoya index and Merrifield–Simmons index, respectively. c © 2008 Elsevier B.V. All rights reserved.
full textthe hosoya index and the merrifield-simmons index of some graphs
the hosoya index and the merrifield-simmons index are two types of graph invariants used in mathematical chemistry. in this paper, we give some formulas for computed these indices for some classes of corona product and link of two graphs. furthermore, we obtain exact formulas of hosoya and merrifield-simmons indices for the set of bicyclic graphs, caterpillars and dual star.
full textMy Resources
Save resource for easier access later
Journal title:
transactions on combinatoricsPublisher: university of isfahan
ISSN 2251-8657
volume 1
issue 4 2012
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023